On Seven Points in the Boundary of a Plane Convex Body in Large Relative Distances
نویسنده
چکیده
By the relative distance of points p and q of a convex body C we mean the ratio of the Euclidean length of the segment pq to the half of the Euclidean length of a longest chord of C parallel to pq. We show that in the boundary of every plane convex body there exist seven points in pairwise relative distances at least 2 3 . We also give an estimate in case of three points. Finding sets of points on the sphere or ball of Euclidean n-space E such that their pairwise distances are as large as possible is a long-standing question of geometry. A generalization was presented by Lassak [6], and by Doyle, Lagarias and Randall [3]. In [3], points are considered in the boundary of the unit ball C of a Minkowski space, and their distance is measured by the Minkowski distance. In [6] we see a more general approach. Here C is allowed to be an arbitary convex body. The question is in finding configurations of points in the boundary of C which are far in the sense of the following notion of C-distance of points. For arbitrary points p, q ∈ E denote the Euclidean length of the segment pq by |pq|. Let p′q′ be a chord of C parallel to pq such that there is no longer chord of C parallel to pq. The C-distance dC(p, q) of points p and q is defined by the ratio of |pq| to 1 2 |p′q′| (see [6]). We also use the term C-length of the segment pq. If there is no doubt about C, we may use the terms relative distance of p and q, or relative length of pq. Both papers [3] and [6] show that every centrally symmetric plane convex body contains four boundary points in pairwise relative distances at least √ 2, and six boundary points whose pairwise relative distances are at least 1. Doliwka [2] proved that in the boundary of every plane convex body there exist five points in at least unit pairwise relative distances. In this paper we show a similar result about seven points in the boundary of a plane convex body. We also improve the estimate in [1] about three far boundary points. Theorem. The boundary of an arbitrary plane convex body contains seven points in pairwise relative distances at least 2 3 such that the relative distances of every two successive
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملModeling of Optimal Distances of Surveying Stations for Monitoring Astable Engineering Structures Using Geodetic Methods
Large and astable engineering structures are the great importance and the behavior of such structures is usually made in Geotechnical and Geodetic methods (engineering geodesy). In the geodetic methods, the selection of appropriate surveying stations, in terms of distribution, locations, and distant of the target points to stations the control network, have a significant role in determining th...
متن کاملA novel Local feature descriptor using the Mercator projection for 3D object recognition
Point cloud processing is a rapidly growing research area of computer vision. Introducing of cheap range sensors has made a great interest in the point cloud processing and 3D object recognition. 3D object recognition methods can be divided into two categories: global and local feature-based methods. Global features describe the entire model shape whereas local features encode the neighborhood ...
متن کاملUniversal points of convex bodies and bisectors in Minkowski spaces
We deal with different properties of a smooth and strictly convex body that depend on the behavior of the planar sections of the body parallel to and close to a given tangent plane. The first topic is boundary points where any given convex domain in the tangent plane can be approximated by a sequence of suitably rescaled planar sections (so-called p-universal points). In the second topic, the g...
متن کاملTOPOLOGY OPTIMIZATION OF PLANE STRUCTURES USING BINARY LEVEL SET METHOD AND ISOGEOMETRIC ANALYSIS
This paper presents the topology optimization of plane structures using a binary level set (BLS) approach and isogeometric analysis (IGA). In the standard level set method, the domain boundary is descripted as an isocountour of a scalar function of a higher dimensionality. The evolution of this boundary is governed by Hamilton–Jacobi equation. In the BLS method, the interfaces of subdomai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004